Some algorithms for skew polynomials over finite fields
نویسندگان
چکیده
In this paper, we study the arithmetics of skew polynomial rings over finite fields, mostly from an algorithmic point of view. We give various algorithms for fast multiplication, division and extended Euclidean division. We give a precise description of quotients of skew polynomial rings by a left principal ideal, using results relating skew polynomial rings to Azumaya algebras. We use this description to give a new factorization algorithm for skew polynomials, and to give other algorithms related to factorizations of skew polynomials, like counting the number of factorizations as a product of irreducibles.
منابع مشابه
Factoring in Skew-Polynomial Rings over Finite Fields
Efficient algorithms are presented for factoring polynomials in the skew-polynomial ring F[x; σ], a non-commutative generalization of the usual ring of polynomials F[x], where F is a finite field and σ: F → F is an automorphism (iterated Frobenius map). Applications include fast functional decomposition algorithms for a class of polynomials in F[x] whose decompositions are “wild” and previously...
متن کاملMatroidal structure of skew polynomial rings with application to network coding
Over a finite field Fqm , the evaluation of skew polynomials is intimately related to the evaluation of linearized polynomials. This connection allows one to relate the concept of polynomial independence defined for skew polynomials to the familiar concept of linear independence for vector spaces. This relation allows for the definition of a representable matroid called the Fqm[x;σ]-matroid, wi...
متن کاملRandom Polynomials over Finite Fields: Statistics and Algorithms
Polynomials appear in many research articles of Philippe Flajolet. Here we concentrate only in papers where polynomials play a crucial role. These involve his studies of the shape of random polynomials over finite fields, the use of these results in the analysis of algorithms for the factorization of polynomials over finite fields, and the relation between the decomposition into irreducibles of...
متن کاملHartmann-Tzeng bound and skew cyclic codes of designed Hamming distance
The use of skew polynomial rings allows to endow linear codes with cyclic structures which are not cyclic in the classical (commutative) sense. Whenever these skew cyclic structures are carefully chosen, some control over the Hamming distance is gained, and it is possible to design efficient decoding algorithms. In this paper, we give a version of the Hartmann-Tzeng bound that works for a wide ...
متن کاملAlgorithms for Noncommutative Differential Operators
The aim of this work is to study some noncommutative differential operators. We take an algorithmic approach as well as further developing the mathematics, and design and analyse algorithms to solve fundamental problems. We also give applications to differential equations. First we consider how to factor skew polynomials. These are polynomials in a differential or difference operator. Using the...
متن کامل